Browsing by Subject "Heuristic methods"

Now showing items 1-12 of 12

    • Conference Object  

      Comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors 

      Dikaiakos, Marios D.; Steiglitz, Kenneth; Rogers, Anne (IEEE, 1994)
      This paper presents a comparison study of popular clustering and mapping heuristics which are used to map task-flow graphs to message-passing multiprocessors. To this end, we use task-graphs which are representative of ...
    • Conference Object  

      Constrained sensor selection for discrete event systems modeled by Petri nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2011)
      This paper studies how to place a minimum number of sensors in discrete event systems modeled by partially observed Petri nets while maintaining structural observability. When the sensors are constrained to be associated ...
    • Conference Object  

      Fuzzy control of ABR traffic flow in ATM LANs 

      Sekercioglu, Y. Ahmet; Pitsillides, Andreas (IEEE, 1995)
      High-speed LANs are beginning to migrate from shared media to switch based configurations (commonly based on ATM architectures). Because of the characteristics of ATM networks and nature of LAN traffic, there is a need for ...
    • Conference Object  

      Integer programs and valid inequalities for planning problems 

      Bockmayr, A.; Dimopoulos, Yannis (Springer Verlag, 2000)
      Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinato-rial search problem. The underlying representation language is basically propositional logic. While ...
    • Conference Object  

      A latency-based object placement approach in content distribution networks 

      Pallis, George C.; Vakali, Athena I.; Stamos, Kostas; Sidiropoulos, Antonis; Katsaros, Dimitrios S.; Manolopoulos, Yannis (2005)
      Content Distribution Networks (CDNs) are increasingly being used to disseminate data in today's Internet. The growing interest in CDNs is motivated by a common problem across disciplines: how does one reduce the load on ...
    • Conference Object  

      Optimal graph design using a knowledge-driven multi-objective evolutionary graph algorithm 

      Nicolaou, Christos A.; Kannas, Christos C.; Pattichis, Constantinos S. (2009)
      Designing appropriate graphs is a problem frequently occurring in several common applications ranging from designing communication and transportation networks to discovering new drugs. More often than not the graphs to be ...
    • Conference Object  

      Replication based on Objects Load under a Content Distribution Network 

      Pallis, George C.; Stamos, Kostas; Vakali, Athena I.; Katsaros, Dimitrios S.; Sidiropoulos, Antonis; Manolopoulos, Yannis (Institute of Electrical and Electronics Engineers Inc., 2006)
      Users tend to use the Internet for "resource-hungry" applications (which involve content such as video, audio on-demand and distributed data) and at the same time, more and more applications (such as e-commerce, elearning ...
    • Conference Object  

      A similarity based approach for integrated Web caching and content replication in CDNs 

      Stamos, Kostas; Pallis, George C.; Thomos, Charilaos; Vakali, Athena I. (2006)
      Web caching and content replication techniques emerged to solve performance problems related to the Web. We propose a generic non-parametric heuristic method that integrates both techniques under a CDN. We provide ...
    • Conference Object  

      Soft-decision decoding of linear block codes using efficient iterative G-space encodings 

      Wu, Y.; Hadjicostis, Christoforos N. (2001)
      This paper proposes a sub-optimal maximum likelihood decoding algorithm for linear block codes. Given reliability information about each bit in the received word, our approach initially finds the set of most reliable "basis" ...
    • Article  

      Towards local search for answer sets 

      Dimopoulos, Yannis; Sideris, A. (2002)
      Answer set programming has emerged as a new important paradigm for declarative problem solving. It relies on algorithms that compute the stable models of a logic program, a problem that is, in the worst-case, intractable. ...
    • Conference Object  

      Two-phase commit optimizations and tradeoffs in the commercial environment 

      Samaras, George S.; Britton, Kathryn; Citron, Andrew; Mohan, C. (Publ by IEEE, 1993)
      An atomic commit protocol can ensure that all participants in a distributed transaction reach consistent states, whether or not system or network failures occur. One widely used protocol is the two-phase commit (2PC) ...
    • Conference Object  

      Vibration Measurement of Occupational Exposed Workers, Experimental Quantification of the Individual Response Parameters for the Estimation of Uncertainty in the Vertical Direction 

      Kyprianou, Andreas; Vazouras, A. (American Society of Civil Engineers (ASCE), 2014)
      The exposure of seated people to whole body vibration has been extensively researched and modelled during the past two decades. The trend is to use the average biodynamic responses. This paper investigates the relation of ...